probFD

python2.7 ../probfd-qcomp19/builds/release64/bin/translate/translate.py domain.pddl p06-x11-y11-h4-v3-u40-s6.pddl
../probfd-qcomp19/builds/release64/bin/downward --sas output.sas --engine fretpi-hdp --heuristic hmax --enable-caching --epsilon 1e-6

Parsing...
Parsing: [0.010s CPU, 0.016s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.000s CPU, 0.004s wall-clock]
Generated 328 rules.
Computing model... [0.130s CPU, 0.133s wall-clock]
17060 relevant atoms
2994 auxiliary atoms
20054 final queue length
52076 total queue pushes
Completing instantiation... [0.620s CPU, 0.618s wall-clock]
Instantiating: [0.770s CPU, 0.770s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.000s CPU, 0.004s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.000s CPU, 0.004s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.029s wall-clock]
Translating task: [0.540s CPU, 0.536s wall-clock]
109 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
2 propositions removed
Detecting unreachable propositions: [0.270s CPU, 0.274s wall-clock]
Reordering and filtering variables...
3 of 3 variables necessary.
0 of 2 mutex groups necessary.
15854 of 15854 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.050s CPU, 0.049s wall-clock]
Translator variables: 3
Translator derived variables: 0
Translator facts: 24
Translator goal facts: 3
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 15854
Translator axioms: 0
Translator task size: 92033
Translator peak memory: 110640 KB
Writing output... [0.080s CPU, 0.078s wall-clock]
Done! [1.750s CPU, 1.756s wall-clock]	

Warning: :types specification not allowed here (cf. PDDL BNF)	

reading input... [t=0.000147935s]
done reading input! [t=0.0187983s]
variables: 3
goals: 3
actions: 15854
axioms: 0
has conditional effects: 0
reconstructing probabilistic actions... [t=0.018812s]
done reconstructing probabilistic actions! [t=0.0310186s]
probabilistic actions: 15369 (with 16089 outcomes)
constructing successor generator... [t=0.0337168s]
done constructing successor generator! [t=0.0343615s]
Bytes per state: 4
Property: MaxProb
Preparing hmax dead end detection heuristic... [t=0.0347103s]
hmax initialization done! [t=0.0365655s]
Engine: FRET-pi with HDP
Starting trap elimination heuristic search wrapper...
Initial state reward: 1
Expansions: 100
Registered states: 229
Generated states: 1333
Cached transitions: 719
Expansion cache hits: 132
Transition cache hits: 26519
Approximate transition cache memory usage: 25KB
Solver time: 0.002509137000000001561s
Total time: 0.0391435030000000031s